Search results for "Signal processing algorithms"
showing 7 items of 7 documents
Fast Implementation of Double-coupled Nonnegative Canonical Polyadic Decomposition
2019
Real-world data exhibiting high order/dimensionality and various couplings are linked to each other since they share some common characteristics. Coupled tensor decomposition has become a popular technique for group analysis in recent years, especially for simultaneous analysis of multi-block tensor data with common information. To address the multiblock tensor data, we propose a fast double-coupled nonnegative Canonical Polyadic Decomposition (FDC-NCPD) algorithm in this study, based on the linked CP tensor decomposition (LCPTD) model and fast Hierarchical Alternating Least Squares (Fast-HALS) algorithm. The proposed FDCNCPD algorithm enables simultaneous extraction of common components, i…
Fast Image Restoration Algorithms Based on PDE Models Using Modified Hopfield Neural Network
2010
Two image restoration algorithms based on modified Hop field neural network and variational partial differential equations (PDE) were proposed in our previous work [1, 2]. But the convergence rate of the proposed algorithms was slow. In this paper, we develop a fast update rule based on modified Hop field neural network (MHNN) of continuous state change and two fast image restoration algorithms. Experimental results show that, when compared with the previous algorithms, our proposed algorithms have better performance both in convergence rate and in image restoration quality.
A morphology-based approach to the evaluation of atrial fibrillation organization.
2007
Online Edge Flow Imputation on Networks
2022
Author's accepted manuscript © 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. An online algorithm for missing data imputation for networks with signals defined on the edges is presented. Leveraging the prior knowledge intrinsic to real-world networks, we propose a bi-level optimization scheme that exploits the causal dependencies and the flow conservation, respe…
Upgrade of the ATLAS Level-1 trigger with an FPGA based Topological Processor
2013
The ATLAS experiment is located at the European Centre for Nuclear Research (CERN) in Switzerland. It is designed to measure decay properties of high energetic particles produced in the protons collisions at the Large Hadron Collider (LHC). The LHC has a proton collision at a frequency of 40 MHz, and thus requires a trigger system to efficiently select events down to a manageable event storage rate of about 400Hz. Event triggering is therefore one of the extraordinary challenges faced by the ATLAS detector. The Level-1 Trigger is the first rate-reducing step in the ATLAS Trigger, with an output rate of 75kHz and decision latency of less than 2.5$\mu$s. It is primarily composed of the Calori…
An Embedded Processor for Metabolic Networks Optimization
2011
In recent years biological processes modelling and simulation have become two key issues in analyzing complex cellular systems. The computational requirements suggest to investigate alternative solutions to the common supercomputers and clusters in order to optimize and overcome computational bottleneck. The goal of this work is the design and the realization of an embedded processor for metabolic networks optimization in order to examine their behaviour and robustness under malfunctions of one or more nodes. The embedded processor has been prototyped on the Celoxica RC203E board, equipped with programmable FPGA technologies. A case studied outlining the E. Coli bacteria metabolic network i…
Iterative Reconstruction of Signals on Graph
2020
We propose an iterative algorithm to interpolate graph signals from only a partial set of samples. Our method is derived from the well known Papoulis-Gerchberg algorithm by considering the optimal value of a constant involved in the iteration step. Compared with existing graph signal reconstruction algorithms, the proposed method achieves similar or better performance both in terms of convergence rate and computational efficiency.